recursive data structure meaning in Chinese
弟归数据结构
递归数据结构
Examples
- The lazy evaluation feature is needed to handle recursive data structures like trees and graphs
懒惰求值的特性常用在处理像tree或者graph这样的递归数据结构上。 - From there , you can use all the higher order techniques haskell provides for dealing with recursive data structures
从那里，可以使用haskell提供的所有高阶技术来处理递归数据结构。 - The library haxml creates representations of xml documents as native recursive data structures in the functional language haskell
库haxml中将xml文档的表示创建成函数性语言haskell中原始的递归数据结构。